EE229B - Final Project Capacity-Approaching Low-Density Parity-Check Codes
نویسنده
چکیده
The class of low-density parity-check (LDPC) codes was introduced by Gallager in his thesis in 1961 [2]. Until the invention of turbo codes, they were largely neglected, but received a lot of interest lately, due to the possibility of designing LDPC codes within 0.0045 dB of the Shannon limit. We review in this project techniques used to analyze the performance of LDPC codes under a message-passing decoding algorithm, namely belief propagation (BP) [4][5]. This analysis gives us the tools to design good LDPC codes. We will first take the simpler example of transmission over the class of binary erasure channels (BEC). We will then see how it is possible to extend the results for the BEC to the much more general class of symmetric channels.
منابع مشابه
Low-Density Parity-Check Code with Fast Decoding Speed
Low-Density Parity-Check (LDPC) codes received much attention recently due to their capacity-approaching performance. The iterative message-passing algorithm is a widely adopted decoding algorithm for LDPC codes [7]. An important design issue for LDPC codes is designing codes with fast decoding speed while maintaining capacityapproaching performance. In another words, it is desirable that the c...
متن کاملNew Iterative Decoding Algorithms for Low-Density Parity-Check (LDPC) Codes
Low-Density Parity-Check (LDPC) codes have gained lots of popularity due to their capacity achieving/approaching property. This work studies the iterative decoding also known as message-passing algorithms applied to LDPC codes. Belief propagation (BP) algorithm and its approximations, most notably min-sum (MS), are popular iterative decoding algorithms used for LDPC and turbo codes. The thesis ...
متن کاملDesign of capacity-approaching irregular low-density parity-check codes
We design low-density parity-check (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on [1]. Assuming that the underlying communication channel is symmetric, we prove that the probability densities at the message...
متن کاملCapacity-Approaching Joint Source-Channel Coding for Asymmetric Channels with Low-Density Parity-Check Codes
By only sending the parity bits, joint source-channel coding can be natively achieved with lowdensity parity-check codes. However, the code ensemble design of optimal low-density parity-check codes for joint source-channel coding over asymmetric communication channels is difficult. To circumvent such a difficulty, source-channel adaptors is proposed in this paper. By using the source-channel ad...
متن کاملApproaching the Slepian-Wolf Limit with LDPC Coset Codes
We consider the Slepian-Wolf code design based on LDPC (low-density parity-check) coset codes. We derive the density evolution formula for the Slepian-Wolf coding, equipped with a concentration theorem. An intimate connection between the Slepian-Wolf coding and channel coding is established. Specifically we show that, under density evolution, each Slepian-Wolf source coding problem is equivalen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005